Edsger W. Dijkstra - PDFSEARCH.IO - Document Search Engine

Edsger W. Dijkstra
Results: 213

#	Item
51	PDF Document Add to Reading List Source URL: www.etaps.org Language: English - Date: 2016-03-31 11:43:47 Edsger W. Dijkstra Computing Computer science Software engineering THE multiprogramming system European Joint Conferences on Theory and Practice of Software Dijkstra Turing Award Semaphore
52	A 4-Geometry Maze Router and Its Application on Multiterminal Nets GENE EU JAN National Taipei University KI-YIN CHANG National Taiwan Ocean University Add to Reading List Source URL: www.ntpu.edu.tw Language: English - Date: 2005-11-20 09:42:42 Electronic design automation Theoretical computer science Mathematics Electronic engineering Edsger W. Dijkstra Design Routing algorithms Maze runner Routing Algorithm Shortest path problem Motion planning
53	Bachelor / Master Thesis Shortest paths in disk coverings Description. Suppose you are travelling from town A to town B with a mobile communication device. To ensure you never lose connection, you decide to travel only Add to Reading List Source URL: page.math.tu-berlin.de Language: English Mathematics Differential forms Network theory Edsger W. Dijkstra Shortest path problem Mathematical analysis Closed and exact differential forms Riemann surfaces
54	SIGACCESS Annual Report JulyJune 2013 Submitted by: Andrew Sears, Chair SIGACCESS continues to refine its activities to meet member needs. This report highlights SIGACCESS Awards as well as the SIG’s conference Add to Reading List Source URL: www.acm.org Language: English - Date: 2013-10-11 11:30:28 Computer science Computing Theoretical computer science Science and technology Edsger W. Dijkstra Fellows of the British Computer Society ACM SIGACT Association for Computing Machinery Symposium on Theory of Computing Symposium on Parallelism in Algorithms and Architectures ACM-W Symposium on Principles of Distributed Computing
55	Microsoft PowerPoint - livelock-rv12 Add to Reading List Source URL: rv2012.ku.edu.tr Language: English - Date: 2012-10-04 10:58:49 Concurrency control Edsger W. Dijkstra Computing Software engineering Computer programming Concurrency Reentrant mutex Deadlock Lock Mutual exclusion Thread
56	Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-11-30 21:17:11 Spanning tree NP-complete problems Routing algorithms Edsger W. Dijkstra Combinatorial optimization Steiner tree problem Minimum spanning tree Shortest path problem Eulerian path Algorithm Randomized algorithm Matching
57	On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2014-04-14 14:04:38 NP-complete problems Graph theory Network theory Edsger W. Dijkstra Shortest path problem Maximal independent set Independent set Matching Bipartite graph Degree Graph Line graph
58	Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:11 Network theory NP-complete problems Edsger W. Dijkstra Graph coloring Spanning tree Matching Shortest path problem Logical matrix Treewidth Matrix Minimum spanning tree Clique
59	Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg Add to Reading List Source URL: ad-publications.informatik.uni-freiburg.de Language: English - Date: 2013-04-29 10:40:39 NP-complete problems Combinatorial optimization Routing algorithms Search algorithms Edsger W. Dijkstra Dominating set A* search algorithm Optimization problem Minimum spanning tree Shortest path problem Treewidth Flow network
60	CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-04 19:18:44 NP-complete problems Edsger W. Dijkstra Spanning tree Matroid theory Operations research Online algorithm Steiner tree problem Matroid Shortest path problem Algorithm Travelling salesman problem Greedy algorithm

UPDATE